A Fast Algorithm to Display Octrees
نویسندگان
چکیده
The octree is a common data structure used to model 3-dimensional data. The linear octree is a compact representation of an octree. In this paper we deal with the problem of displaying three-dimensional objects represented using linear octree, and offer a new, efficient solution. Our algorithm rearranges voxels of a linear octree in order of increasing distance from the viewer, This list is rendered using a back to front painter’s algorithm, or a front-to-back algorithm. We compare our visible surface determination algorithm with that of a variant based on prior work.
منابع مشابه
Efficient Algorithms for Octree Motion
This paper presents e cient algorithms for updating moving octrees. The rst algorithm works for octrees undergoing both translation and rotation motion; it works efciently by compacting source octrees into a smaller set of cubes (not necessarily standard octree cubes) as a precomputation step, and by using a fast, exact cube/cube intersection test between source octree cubes and target octree c...
متن کاملHighly Parallel Surface Reconstruction
We present a parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds an octree for the given set of oriented points, then computes an implicit function over the space of the octree, and finally extracts an isosurface as a water-tight triangle mesh. A key component of our algorithm is a novel techn...
متن کاملInstant Points: Fast Rendering of Unprocessed Point Clouds
We present an algorithm to display enormous unprocessed point clouds at interactive rates without requiring long postprocessing. The novelty here is that we do not make any assumptions about sampling density or availability of normal vectors for the points. This is very important because such information is available only after lengthy postprocessing of scanned datasets, whereas users want to i...
متن کاملOctree Generation from Object Silhouettes in Perspective Views
Octrees are useful for object representation when fast access to coarse spatial occupancy information is necessary. This paper presents an efficient algorithm for generating octrees from multiple perspective views of an object. The algorithm first obtains a polygonal approximation of the object silhouette. This polygon is then decomposed into convex components. For each convex component, a pyra...
متن کاملlnteger Dilation and Contraction for Quadtrees and Octrees
~ Integer dilation and contraction are functions used in conjunction with quadtree and octree mapping systems. Dilation is the process of inserting a number of zeros before each bit in a word and contraction is the process of removing those zeros. Present methods of dilation and contraction involve lookup tables which consume considerable amounts of memory for mappings of large or high resoluti...
متن کامل